Ju n 19 96 POLYNOMIAL INVARIANTS ARE POLYNOMIAL
نویسنده
چکیده
We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type m is evaluated on a knot projection having n crossings, the result is bounded by a constant times nm. Thus the well known analogy between Vassiliev invariants and polynomials justifies (well, at least explains) the odd title of this note.
منابع مشابه
On the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملLinks, Quantum Groups and Tqfts
X iv :q -a lg /9 50 60 02 v2 3 1 Ju l 1 99 5 Abstract. The Jones polynomial and the Kauffman bracket are constructed, and their relation with knot and link theory is described. The quantum groups and tangle functor formalisms for understanding these invariants and their descendents are given. The quantum group Uq(sl2), which gives rise to the Jones polynomial, is constructed explicitly. The 3-m...
متن کاملar X iv : m at h / 06 07 79 4 v 1 [ m at h . G T ] 3 1 Ju l 2 00 6 MUTATION AND THE COLORED JONES POLYNOMIAL
We show examples of knots with the same polynomial invariants and hyperbolic volume, with variously coinciding 2-cable polynomials and colored Jones polynomials, which are not mutants. AMS Classifications: 57M25, 57N70
متن کاملAsymptotic Behaviors of the Colored Jones Polynomials of a Torus Knot
Let K be a knot in the three-sphere and JN (K; t) the colored Jones polynomial corresponding to the N -dimensional representation of sl2(C) normalized so that JN (unknot; t) = 1 [8, 12]. R. Kashaev found a series of link invariants parameterized by positive integers [9] and proposed a conjecture that the asymptotic behavior of his invariants would determine the hyperbolic volume of the knot com...
متن کاملThe Neighbourhood Polynomial of some Nanostructures
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996